Efficient general AGH-unification

Efficient Unification of Quantified Terms

D Conventional logic-programming languages rely fundamentally on symbolic computation with quantifier-free terms. Much theoretical logic uses the richer vocabulary of quantified terms, however. In this paper we sketch some first steps in a program of research for developing data structures and algorithms to support efficient computation directly on quantified terms. We describe a simple concept...

Efficient Finite State Unification Morphology

Yet Another Efficient Unification Algorithm

The unification algorithm is at the core of the logic programming paradigm, the first unification algorithm being developed by Robinson [5]. More efficient algorithms were developed later [4] and I introduce here yet another efficient unification algorithm centered on a specific data structure, called the Unification Table.

Efficient Algorithms for Semantic Unification

The problem of matching vague terms must be addressed in knowledge-based systems involving uncertainty. Fril is a logic programming language extended by an integrated set of features for handling uncertain knowledge, based on the theoretical foundations provided by Baldwin’s mass assignment theory. This combines probabilistic and fuzzy uncertainty into a single framework. One of the fundamental...

Efficient Functional Unification and Substitution

Implementations of language processing systems often use unification and substitution to compute desired properties of input language fragments; for example when inferring a type for an expression. Purely functional implementations of unification and substitution usually directly correspond to the formal specification of language properties. Unfortunately the concise and understandable formulat...